Architecture Reenement

نویسندگان

  • Mark Moriconi
  • Xiaolei Qian
چکیده

| A method is presented for the stepwise reene-ment of an abstract architecture into a relatively correct lower-level architecture that is intended to implement it. A reenement step involves the application of a predeened re-nement pattern that provides a routine solution to a standard architectural design problem. A pattern contains an abstract architecture schema and a more detailed schema intended to implement it. The two schemas usually contain very diierent architectural concepts (from diierent architectural styles). Once a reenement pattern is proven correct , instances of it can be used without proof in developing speciic architectures. Individual reenements are composi-tional, permitting incremental development and local reasoning. A special correctness criterion is deened for the domain of software architecture, as well as an accompanying proof technique. A useful syntactic form of correct composition is deened. The main points are illustrated by means of familiar architectures for a compiler. A prototype implementation of the method has been used successfully in a real application.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correct Transformation Rules for Incremental Development of Architecture Hierarchies

In previous papers, my colleagues and I deened what it means to say that an architecture reenement hierarchy is correct, and showed how to prove correctness of reenement steps. This paper builds upon that earlier work by extending the notion of correctness to apply to architecture transformation rules that can be used to incrementally build hierarchies. Perhaps surprisingly, it is not the case ...

متن کامل

Subsumption and Reenement in Model Inference

In his famous Model Inference System, Shapiro 10] uses so-called reenement operators to replace too general hypotheses by logically weaker ones. One of these reenement operators works in the search space of reduced rst order sentences. In this article we show that this operator is not complete for reduced sentences, as he claims. We investigate the relations between subsumption and reenement as...

متن کامل

Hypertext-Based Parallel Programming Environment

We will describe initial investigation into a software architecture which supports a reenement-based parallel programming methodology. The architecture is based on blending a component-based visual programming approach with the hyptertext model to give a seamless programming environment for parallel program development targeting various platforms, where hypertext links capture reenement steps a...

متن کامل

Stepwise Reenement of Data Flow Architectures

Software and hardware architectures are prone to modiications. We demonstrate how a mathematically founded reenement calculus for a class of ar-chitectures, namely data ow networks, can be used to modify a system in a provably correct way. The calculus consists of basic rules to add and to remove components and channels to a system.

متن کامل

Style-based Reenement for Software Architecture

A question that frequently arises for architectural design is \When can I implement a design in style S1 using a design in style S2?" In this paper I propose a technique for structur-ing a solution to this kind of problem using the idea of sub-styles. This technique leads to a two-step process in which rst, useful subsets of a family of architectures are identi-ed, and second, reenement rules s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995